minimum search
英 [ˈmɪnɪməm sɜːtʃ]
美 [ˈmɪnɪməm sɜːrtʃ]
【计】最小值检索
双语例句
- Combined with the gradient search, a hybrid genetic algorithm is formed to overcome the local minimum of the gradient search and the slowness of convergence rate of simple genetic algorithms.
同时，将遗传算法与梯度优化方法相结合，使得混合型遗传算法有效地解决了梯度算法局部极小问题和简单遗传算法的收敛速度慢问题。 - The optimization module consideres the time value of capital investment, and the minimum annual cost is its object which takes investment and loss into account, and the generation tree of the alternative network is used as Tabu search initial solution.
优化模型考虑线路投资的时间价值，以计及投资和损耗费用的年费用最小为目标函数，采用点溶合法求解备选网络的生成树作为Tabu搜索的初始解。 - Focusing on the disadvantages in the BP neural network such as low convergence rate, easily falling into local minimum point and weak global search capability, a new method that used GA to train BP neural networks to gain best weights was presented.
针对传统的BP算法存在收敛速度比较慢、容易陷入局部极小值以及全局搜索能力弱等缺陷，提出了神经网络与遗传算法相结合的方法，采用遗传算法训练BP神经网络，优化网络权值。 - By considering the rearrange effect and the minimum quality requirement, a new algorithm based on local search is presented to allocate the transmission bit budget between the source and channel codes.
在考虑重排效果和解码图像最小质量要求的前提下，提出了一种基于局部搜索的信源/信道码率分配新算法。 - This matrix correlates all measurement residuals with minimum resolution search space directly.
该矩阵将所有的测量残差直接和最小求解搜索空间相关联。 - The proposed algorithm, TABU-Clustering, is com-posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。 - During the encoding process, the algorithm first selects the codeword that has minimum mean distance from the input vector as the tentative matching codeword, and then applies two efficient elimination criteria to search the nearest codeword close to the tentative matching codeword up and down.
在编码过程中，首先选取与输入矢量均值最近的码字作为初始匹配码字，然后利用两条有效的删除准则在该码字附近进行上下搜索与输入矢量最近的码字。 - The sub field Ritz method presented in this paper is based on the minimum potential energy principle to search an optimum approximate solution of elastic system balance problem through the method of energy variation extreme value.
子域Ritz法是基于最小势能原理，通过能量变分极值方法，寻求弹性系平衡问题的最佳逼近值。 - The algorithm takes minimum square error and spatial correlation as matching function and adapts four-step search algorithm to calculate motion vectors. The result is compared with that of full search algorithm.
该算法利用最小均方误差和块间运动矢量的空间相关性作为匹配函数，采用四步搜索法计算运动矢量，并和全搜索算法得到的运动矢量进行比较。 - Post-processing the image and the Gray-coded Bit-planes were achieved, based on the minimum correlation measure to search the most matching image through three step searching algorithm and estimate the motion parameters between the previous and current image. The compensation parameters were generated through respective weights.
对图像进行预处理，获得灰度编码位平面，采用三步搜索方法，以互相关函数最小为匹配准则，对前后帧图像的灰度编码位平面做匹配搜索，得到图像的运动矢量。 - A fast search algorithm for half-pixel motion estimation is proposed based on the characteristic. The SAD distortion function increases monotonously as the search location moves away from the global sub-pixel minimum within ± 1 pixel neighborhood of the result of integer-pixel search.
提出了一种基于在整像素搜索结果的±1像素邻域内SAD函数随着与亚像素全局最小点距离的增加而单调增大的半像素两步快速搜索算法。 - Based on blind deconvolution using minimum entropy criteria, the method, which starts right with complex phase degraded SAR images, carries out phase errors correction via multidimensional search.
该方法从复图像域出发，利用最小熵准则盲解卷积原理，通过多维搜索完成相位误差校正。 - Minimum error estimation using wavelet for time series similarity search
对时间序列相似性查询的最优小波误差估计 - Spatial object's minimum bounding rectangle approximately reflects the spatial characters of spatial objects, which speeds the search process.
空间对象的外接矩形能够粗略反映出空间对象的空间特性，从而加速空间对象的定位过程。 - To overcome the local minimum of Bayesian network hybrid learning algorithm-greedy Bayesian pattern search algorithm ( GBPS), an improved algorithm was proposed by introducing the operation of reversing the directed edges in the generation of pattern search space.
针对贪婪贝叶斯模式搜索算法（GBPS）在搜索最优贝叶斯网络结构时易陷入局部最优的不足，提出了一种改进的GBPS算法。 - The multicast routing algorithm is based on Prim's MST ( Minimum Spanning Tree) algorithm and K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound.
组播路由算法以Prim最小生成树算法和K-度宽度优先搜索方法为基础，生成一棵满足给定延迟时限的最小成本树。 - So it can both avoid local minimum and have good global search ability.
因此该算法不仅可以避免陷入局部最优，并且具有很好的全局搜索能力。 - In my paper, the phase gradient method, the minimum entropy search algorithm, and the autocorrelation algorithm were simulated and done some sample performance analysis.
对相位梯度法、最小熵搜索法、自相关算法进行了仿真实验和性能分析。 - Meanwhile, the experiments show that the approximate global minimum partition of the coarsest graph may be the local minimum partition of the finest graph and we need to strengthen the global search ability of refinement algorithm in the refinement phase. 3.
同时实验数据也反映了在最小图上的全局近似最优剖分可能是初始图的局部最优剖分，需要加强多水平优化阶段的迁移优化算法逃离局部最优的能力。 - In order to solve the shortcoming in the BP algorithm, such as slowness in training speed and convergence to the local minimum, genetic algorithm with the ability of strong global search is integrated.
为了解决神经网络自身收敛速度慢和容易陷入局部极小的缺陷，利用具有全局搜索能力强等优点的遗传算法与之相结合。 - After analyzing the shortest path algorithm and the minimum transfer times algorithm, this paper proposes the optimal path search algorithm with restricted areas.
在研究分析基于最短路径换乘算法和最少换乘次数算法的基础上，提出了限制区域最广路径搜索算法。 - The smaller local minimum number is in a search space, the smoother it is. In order to control the smooth level, i.e., the local minimum number, we introduce a parameter named smoothing factor in smoothing operator.
为了控制搜索空间的平滑程度，我们引入了平滑因子参数来控制平滑算子。 - The minimum search of the noisy speech power spectrum is the foundation of noise estimation.
含噪语音短时功率谱的最小值搜索是噪声估计的基础。 - The experimental results show that, for highly non-stationary noise, the proposed minimum search method can effectively reduce the delay of noise estimation and significantly improve the quality of enhanced speech.
实验结果表明，对于高度非平稳的噪声，这种最小值搜索方法能够有效的减小噪声估计的延时问题，显著提高增强后语音的质量。 - Second extract the minimum enclosing rectangle, centroid, area and other features and then estimate these use kalman filter, so that the features and search box could be optimum value.
对保留的前景目标求取最小外接矩，形心，面积等特征并利用kalman滤波器建立预估计模型，使特征和搜索框达到最优值。 - The model pursuited the minimum transportation costs. ( 2) On the basis of analyzing the advantages and disadvantages of various heuristic algorithms, the paper adapte a hybrid adaptive genetic and tabu search algorithm to solve the static vehicle scheduling problem.
在分析各种启发式算法优缺点的基础上，基于已建立的集送货一体化车辆调度模型，结合自适应遗传算法和禁忌算法的优点，采用混合自适应遗传禁忌算法，求解静态车辆调度问题。 - In contrast to these(?) values, choice of value minimum appearance as a new starting point, then release the internal force, make shell vibration from the new starting point search for the next extreme point.
对比这些外形的（？）的值，选择（？）值最小的外形为新的起点，释放内力后，网壳从新的起点开始振动寻找下一个极值点。 - We find out that the local suboptimal minimum 'traps' embedded in the search space is the real reason that affects the clustering result quality by analyzing the solving way of heuristic clustering algorithm.
通过对启发式聚类算法的求解方式进行分析后发现，影响启发式聚类算法质量的原因是分布在搜索空间中的局部极小值陷阱。 - The minimum Ulam distance between the new individual and members in tabu list is set in order to ensure the diversity of population, which can improve the global search capability.
通过设置候选解与禁忌列表中的个体之间的最小Ulam距离，以保证种群的多样性，提高全局搜索能力。 - Making the sum of error square between vehicle track model output and measurement value to be minimum is used as parameter estimation rule, and genetic algorithm is adopted to search the optimum solution in the solution space.
参数估计准则采用车辆轨道耦合模型与车辆测量模型输出之差平方和最小，利用遗传算法在解空间内直接搜索轨道静态不平顺的最优解。